A Flat Chart Technique for Embedded OS Testing
نویسندگان
چکیده
منابع مشابه
A Blind Hammerstein Diversity Combining Technique for Flat Fading Channels
Diversity combining techniques play an important role in combating the destructive effects of channel fading in wireless communication systems. In this work we present a blind diversity combining technique for Rayleigh flat fading channels based on Hammerstein type filters. We show that the performance of this technique is very close to ideal MRC system which is accepted as an optimum receiver ...
متن کاملAdvances on Testing C-Planarity of Embedded Flat Clustered Graphs
We show a polynomial-time algorithm for testing c-planarity of embedded flat clustered graphs with at most two vertices per cluster on each face.
متن کاملAn Embedded IDDQ Testing Architecture and Technique
In this paper an embedded IDDQ testing architecture is presented that targets to overcome the excessive hardware overhead requirements in built-in current sensing based testing applications. Moreover, a technique that utilises the IEEE 1149.1 boundary scan standard to control the proposed architecture is provided. The proposed solution is characterised by low silicon area requirements and permi...
متن کاملA review of elongation of os calcis for flat feet.
Between 1959 and 1974 the late Dillwyn Evans treated severe symptomatic flat feet by elongating the os calcis. The long-term follow-up of 20 of these patients with a total of 23 feet is presented 7 to 20 years after the operation. At review 17 of the 23 feet showed very good or good results and it was concluded that this is a useful procedure for severe cases of flat feet which appears to stand...
متن کاملEfficient C-Planarity Testing for Embedded Flat Clustered Graphs with Small Faces
Let C be a clustered graph and suppose that the planar embedding of its underlying graph is fixed. Is testing the c-planarity of C easier than in the variable embedding setting? In this paper we give a first contribution towards answering the above question. Namely, we characterize c-planar embedded flat clustered graphs with at most five vertices per face and give an efficient testing algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the Institute for System Programming of the RAS
سال: 2017
ISSN: 2079-8156,2220-6426
DOI: 10.15514/ispras-2017-29(5)-5